Finite Point Configurations in the Plane, Rigidity and Erdős Problems
نویسندگان
چکیده
منابع مشابه
1 Finite Point Configurations
The study of combinatorial properties of finite point configurations is a vast area of research in geometry, whose origins go back at least to the ancient Greeks. Since it includes virtually all problems starting with “consider a set of n points in space,” space limitations impose the necessity of making choices. As a result, we will restrict our attention to Euclidean spaces and will discuss p...
متن کاملAbstract and Generic Rigidity in the Plane
AND GENERIC RIGIDITY IN THE PLANE SACHIN PATKAR, BRIGITTE SERVATIUS, AND K. V. SUBRAHMANYAM Abstract. We consider the concept of abstract 2–dimensional rigidity and provide necessary and sufficient conditions for a matroid to be an abstract rigidity matroid of a complete graph. This characterization is a natural extenWe consider the concept of abstract 2–dimensional rigidity and provide necessa...
متن کاملFaster Algorithms for Rigidity in the Plane
In [1], a new construction called red-black hierarchy characterizing Laman graphs and an algorithm for computing it were presented. For a Laman graph G = (V,E) with n vertices it runs in O(n) time assuming that a partition of G + e, e ∈ E into two spanning trees is given. We show that a simple modification reduces the running time to O(n log n). The total running time can be reduced O(n √ n log...
متن کاملFOCAL POINT AND FOCAL K-PLANE
This paper deals with the basic notions of k-tautimmersions . These notions come from two special cases; that is, tight and taut immersions. Tight and taut based on high and distance functions respectively and their basic notions are normal bundle, endpoint map, focal point, critical normal. We generalize hight and distance functions to cylindrical function and define basic notions of k-taut ...
متن کاملLong non-crossing configurations in the plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computational Geometry, 1993). Given a set of n points in the plane in general position (no three points collinear), compute a longest non-crossing configuration composed of straight line segments that is: (a) a matching (b) a Ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Steklov Institute of Mathematics
سال: 2018
ISSN: 0081-5438,1531-8605
DOI: 10.1134/s0081543818080114